Quantized surface complementarity diversity (QSCD): a model based on small molecule-target complementarity.
نویسندگان
چکیده
A model of molecular diversity is presented. The model, termed "Quantized Surface Complementarity Diversity" (QSCD), defines molecular diversity by measuring molecular complementarity to a fully enumerated set of theoretical target surfaces. Molecular diversity space is defined as the molecular complement to this set of enumerated surfaces. Using a set of known test compounds, the model is shown to be biologically relevant, consistently scoring known actives as similar. At the resolution of the model, which examines molecules "quantized" into 4.24 A cubic units and treats four points of specific energetic complementarity, the minimum number of compounds needed to fully cover molecular diversity space up to volume 1070 cubic A is estimated to be on the order of 24 million molecules. Most importantly, QSCD allows for individual points in diversity space to be filled by direct modeling of molecular libraries into detailed 3D templates of shape and functionality.
منابع مشابه
Mapping protein pockets through their potential small-molecule binding volumes: QSCD applied to biological protein structures
Previously we demonstrated a method, Quantized Surface Complementarity Diversity (QSCD), of defining molecular diversity by measuring shape and functional complementarity of molecules to a basis set of theoretical target surfaces [Wintner E.A. and Moallemi C.C., J. Med. Chem., 43 (2000) 1993]. In this paper we demonstrate a method of mapping actual protein pockets to the same basis set of theor...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of medicinal chemistry
دوره 43 10 شماره
صفحات -
تاریخ انتشار 2000